Scheduling Multiple Flows on Parallel Disks
نویسندگان
چکیده
We examine the problem of scheduling concurrent independent flows on multiple-disk I/O storage systems. Two models are considered: in the shared buffer model the memory buffer is shared among all the disks, while in the partitioned buffer model each flow has a private buffer. For the parallel disk model with d > 1 disks it is shown that the problem of minimizing the schedule length of n > 2 concurrent flows is NP-complete for both buffer models. A randomized scheduling algorithm for the partitioned buffer model is analyzed and probabilistic bounds on the schedule length are presented. Finally a heuristic based on static buffer allocation for the shared buffer model is discussed.
منابع مشابه
Scheduling of Multiple Autonomous Guided Vehicles for an Assembly Line Using Minimum Cost Network Flow
This paper proposed a parallel automated assembly line system to produce multiple products having multiple autonomous guided vehicles (AGVs). Several assembly lines are configured to produce multiple products in which the technologies of machines are shared among the assembly lines when required. The transportation between the stations in an assembly line (intra assembly line) and among station...
متن کاملTrade-offs for the Design of Parallel Computers with Multiple I/o Subsystems
Exploiting parallelism is an important issue when transferring data to/from the secondary storage devices. In parallel computers with multiple disks, more than one input-output (I/O) operations can take place at a time. This can achieve better performance and higher speedup for those applications with massive data transfer.In this research work, three common architectures of parallel computers ...
متن کاملA Preemptive multimode resource constrained project scheduling model with cash flows
Resource constrained project scheduling problem is one of the most important issues in project planning and management. The objective function of this problem is to minimize the completion time of a project. When there is budget constraint or high risk for investment, using the criteria such as cash flows is so important. The development of computer systems and processors makes it possible to t...
متن کاملSimultaneous Lot Sizing and Scheduling in a Flexible Flow Line
This paper breaks new ground by modelling lot sizing and scheduling in a flexible flow line (FFL) simultaneously instead of separately. This problem, called the ‘General Lot sizing and Scheduling Problem in a Flexible Flow Line’ (GLSP-FFL), optimizes the lot sizing and scheduling of multiple products at multiple stages, each stage having multiple machines in parallel. The objective is to satisf...
متن کاملToward Scheduling I/O Request of Mapreduce Tasks Based on Markov Model
In Cloud storage of multiple CPU cores, many Mapreduce applications may run in parallel on each compute node and collocate with local Disks storage. These Disks storage are shared by multiple applications that use full CPU power of the node. Each application tends to issue contiguous I/O requests in parallel to the same Disk; however if large number of Mapreduce tasks enters the I/O phase at th...
متن کامل